Regularity, matchings and Cameron–Walker graphs
نویسندگان
چکیده
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملSupereulerian graphs and matchings
A graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α(G) be the maximum number of independent edges in the graph G. In this paper, we show that if G is a 2-edge-connected simple graph and α(G) ≤ 2, then G is supereulerian if and only if G is not K2,t for some odd number t . © 2011 Elsevier Ltd. All rights reserved.
متن کاملDominating Induced Matchings of Finite Graphs and Regularity of Edge Ideals
The regularity of an edge ideal of a finite simple graph G is at least the induced matching number of G and is at most the minimum matching number of G. If G possesses a dominating induced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of G is equal to the minimum matching number of G. In the present paper, from viewpoints of both combinator...
متن کاملBipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملMatchings in Graphs
LP relaxation One way to deal with this is to relax the integrality constraints and allow xe ∈ [0, 1] to get a linear program, which can be solved in polynomial-time. However, this gives rise to fractional matchings. Characteristic vectors of matchings in G can be seen as points in R where m = |E|. The convex hull of all the matchings forms a polytope called the matching polytope M. However, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Collectanea Mathematica
سال: 2019
ISSN: 0010-0757,2038-4815
DOI: 10.1007/s13348-019-00250-9